نتایج جستجو برای: ‎ ‎network simplex algorithm

تعداد نتایج: 1330600  

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

Journal: :international journal of industrial mathematics 0
z. ‎aghababazadeh‎‎ department of mathematics‎, ‎science and‎ ‎research branches‎, ‎islamic azad university‎, ‎tehran‎, ‎iran‎. m. ‎rostamy-‎malkhalifeh‎‎ department of mathematics‎, ‎science and‎ ‎research branches‎, ‎islamic azad university‎, ‎tehran‎, ‎iran‎.

it is well known that in operations research‎, ‎degeneracy can cause a cycle in a network‎ ‎simplex algorithm which can be prevented by maintaining strong‎ ‎feasible bases in each pivot‎. ‎also‎, ‎in a network consists of n arcs‎ ‎and m nodes‎, ‎not considering any new conditions on the entering‎ ‎variable‎, ‎the upper bound of consecutive degenerate pivots is equal‎ $left( ‎begin{array}{c}‎ ‎n...

In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...

Journal: :journal of optimization in industrial engineering 2010
hassan rashidi

in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

Journal: :journal of optimization in industrial engineering 2010
hassan rashidi edward p.k tsang

in this paper, an efficient extension of network simplex algorithm is presented. in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by network simplex algorithm (nsa) and nsa+, which extended the stand...

M. ‎Rostamy-‎Malkhalifeh‎‎, Z. ‎Aghababazadeh‎‎

It is well known that in operations research‎, ‎degeneracy can cause a cycle in a network‎ ‎simplex algorithm which can be prevented by maintaining strong‎ ‎feasible bases in each pivot‎. ‎Also‎, ‎in a network consists of n arcs‎ ‎and m nodes‎, ‎not considering any new conditions on the entering‎ ‎variable‎, ‎the upper bound of consecutive degenerate pivots is equal‎ $left( ‎begin{array}{c}‎ ‎n...

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

Journal: :journal of optimization in industrial engineering 0
hassan rashidi department of computer engineering, islamic azad university of qazvin, qazvin, iran

in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

2009
George Geranis Konstantinos Paparrizos Angelo Sifaleras

The Minimum Cost Network Flow Problem (MCNFP) constitutes a wide category of network flow problems. A Dual Network Exterior Point Simplex Algorithm (DNEPSA) for the MCNFP is presented here, together with some computational results. Similarly to the classical Dual Network Simplex Algorithm (DNSA), the new algorithm starts with a dual feasible tree-solution and, after a number of iterations, it p...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید